A ug 2 00 2 Permutations Which Avoid 1243 and 2143 , Continued Fractions , and Chebyshev Polynomials ∗

نویسندگان

  • Eric S. Egge
  • Toufik Mansour
چکیده

Several authors have examined connections between permutations which avoid 132, continued fractions, and Chebyshev polynomials of the second kind. In this paper we prove analogues of some of these results for permutations which avoid 1243 and 2143. Using tools developed to prove these analogues, we give enumerations and generating functions for permutations which avoid 1243, 2143, and certain additional patterns. We also give generating functions for permutations which avoid 1243 and 2143 and contain certain additional patterns exactly once. In all cases we express these generating functions in terms of Chebyshev polynomials of the second kind.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Permutations Which Avoid 1243 and 2143, Continued Fractions, and Chebyshev Polynomials

Several authors have examined connections between permutations which avoid 132, continued fractions, and Chebyshev polynomials of the second kind. In this paper we prove analogues of some of these results for permutations which avoid 1243 and 2143. Using tools developed to prove these analogues, we give enumerations and generating functions for permutations which avoid 1243, 2143, and certain a...

متن کامل

ul 2 00 3 Restricted 3412 - Avoiding Involutions : Continued Fractions , Chebyshev Polynomials and Enumerations ∗

Several authors have examined connections among restricted permutations, continued fractions, and Chebyshev polynomials of the second kind. In this paper we prove analogues of these results for involutions which avoid 3412. Our results include a recursive procedure for computing the generating function for involutions which avoid 3412 and any set of additional patterns. We use our results to gi...

متن کامل

ar X iv : m at h / 01 08 04 3 v 1 [ m at h . C O ] 6 A ug 2 00 1 Restricted set of patterns , continued fractions , and Chebyshev polynomials

We study generating functions for the number of permutations in Sn subject to set of restrictions. One of the restrictions belongs to S3, while the others to Sk. It turns out that in a large variety of cases the answer can be expressed via continued fractions, and Chebyshev polynomials of the second kind. 2001 Mathematics Subject Classification: Primary 05A05, 05A15; Secondary 30B70 42C05

متن کامل

Horse paths, restricted 132-avoiding permutations, continued fractions, and Chebyshev polynomials

Several authors have examined connections among 132-avoiding permutations, continued fractions, and Chebyshev polynomials of the second kind. In this paper we find analogues for some of these results for permutations π avoiding 132 and 1223 (there is no occurrence πi < πj < πj+1 such that 1 ≤ i ≤ j − 2) and provide a combinatorial interpretation for such permutations in terms of lattice paths. ...

متن کامل

O ct 2 00 6 RESTRICTED MOTZKIN PERMUTATIONS , MOTZKIN PATHS , CONTINUED FRACTIONS , AND CHEBYSHEV POLYNOMIALS

We say that a permutation π is a Motzkin permutation if it avoids 132 and there do not exist a < b such that π a < π b < π b+1. We study the distribution of several statistics in Motzkin permutations, including the length of the longest increasing and decreasing subsequences and the number of rises and descents. We also enumerate Motzkin permutations with additional restrictions, and study the ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002